Un algoritmo genético para el problema de Job Shop Flexible

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementación paralela de un algoritmo genético para el problema del agente viajero usando OpenMP

In this paper explain the traveling salesman problem, solving it through the parallel application of a genetic algorithm, implemented in C language, using OpenMP directives. These solutions to the problem consists to find the shortest route visiting all the cities without repeating some and with the lowest possible cost. The tests were performed at “Laboratorio Nacional de Supercómputo del Sure...

متن کامل

Algoritmo genético para el problema logístico de asignación de la mochila (Knapsack Problem)

The present work addresses the case study of a national trading company through the Knapsack Problem (KP). This logistic problem consists on determining the products to be stored that have the best cost-benefit ratio for the company without affecting its storage capacity. This is the reason why the KP a binary multi-criterion problem of NP-hard complexity. While there are exact tools that can s...

متن کامل

Un Modelo Híbrido de Inteligencia Computacional para Resolver el Problema de Job Shop Scheduling

Resumen. En este trabajo se presenta un modelo híbrido de inteligencia computacional para resolver el problema de job shop scheduling, problema de secuenciación, clasificado como NP Completo. Se propone resolverlo usando la técnica de colonia de hormigas asistida con recocido simulado. Como estrategia de búsqueda global, se usó la técnica de colonia de hormigas y como estrategia de búsqueda loc...

متن کامل

Algoritmo aleatorizado basado en distribuciones deslizantes para el problema de planificación en Sistemas Grid

In this paper we present a randomized algorithm for the online version of the Job Shop problem where jobs are composed of processes with precedence constraints and processors are organized in a Grid topology. The proposed randomized algorithm is based on a new technique that we have denominated as sliding distributions, which aims at combining the advantages of the deterministic approximation a...

متن کامل

Algoritmo de stemming para el gallego

The quantity and quality of the resources and tools for natural language processing for a given language depend on such a language. In the Iberian Peninsula, Galician is one of the languages that lack this type of tools and resources. To contribute to their development, this paper shows a stemmer specifically designed for the Galician language. It was first introduced in 2002, but since then it...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ingeniare. Revista chilena de ingeniería

سال: 2011

ISSN: 0718-3305

DOI: 10.4067/s0718-33052011000100006